Cohen-Macaulay clutters with combinatorial optimization properties and parallelizations of normal edge ideals
نویسندگان
چکیده
منابع مشابه
Cohen-Macaulay clutters with combinatorial optimization properties and parallelizations of normal edge ideals
Let C be a uniform clutter and let I = I(C) be its edge ideal. We prove that if C satisfies the packing property (resp. max-flow min-cut property), then there is a uniform Cohen-Macaulay clutter C1 satisfying the packing property (resp. max-flow min-cut property) such that C is a minor of C1. For arbitrary edge ideals of clutters we prove that the normality property is closed under parallelizat...
متن کاملSequentially Cohen-macaulay Edge Ideals
Let G be a simple undirected graph on n vertices, and let I(G) ⊆ R = k[x1, . . . , xn] denote its associated edge ideal. We show that all chordal graphs G are sequentially Cohen-Macaulay; our proof depends upon showing that the Alexander dual of I(G) is componentwise linear. Our result complements Faridi’s theorem that the facet ideal of a simplicial tree is sequentially Cohen-Macaulay and impl...
متن کاملChordal and Sequentially Cohen-Macaulay Clutters
We extend the definition of chordal from graphs to clutters. The resulting family generalizes both chordal graphs and matroids, and obeys many of the same algebraic and geometric properties. Specifically, the independence complex of a chordal clutter is shellable, hence sequentially Cohen-Macaulay; and the circuit ideal of a certain complement to such a clutter has a linear resolution. Minimal ...
متن کاملCombinatorial Characterizations of Generalized Cohen-macaulay Monomial Ideals
We give a generalization of Hochster’s formula for local cohomologies of square-free monomial ideals to monomial ideals, which are not necessarily square-free. Using this formula, we give combinatorial characterizations of generalized Cohen-Macaulay monomial ideals. We also give other applications of the generalized Hochster’s formula.
متن کاملCohen-Macaulay properties of square-free monomial ideals
In this paper we study simplicial complexes as higher dimensional graphs in order to produce algebraic statements about their facet ideals. We introduce a large class of square-free monomial ideals with Cohen-Macaulay quotients, and a criterion for the Cohen-Macaulayness of facet ideals of simplicial trees. Along the way, we generalize several concepts from graph theory to simplicial complexes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The São Paulo Journal of Mathematical Sciences
سال: 2009
ISSN: 2316-9028,1982-6907
DOI: 10.11606/issn.2316-9028.v3i1p61-75